Complete Problems for Dynamic Complexity Classes
نویسندگان
چکیده
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC , the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a singlestep version of the circuit value problem (SSCV). Of independent interest, our construction also produces a first-order formula, , that is in a sense universal for all first-order formulas. Since first-order formulas are stratified by quantifier depth, the first-order formula emulates formulas of greater depth by iterated application. As a corollary we obtain a fixed quantifier block, QBC, that is complete for all first-order quantifier blocks.
منابع مشابه
A Complexity Theoretic Approach to Incremental Computation
We present a new complexity theoretic approach to incremental computation. We deene complexity classes that capture the intuitive notion of incremental eeciency and study their relation to existing complexity classes. We show that all common LOGSPACE-complete problems for P are incr-POLYLOGTIME-complete for P. This suggests that non-redundant problems that seem inherently unparallelizable also ...
متن کاملAlmost Completeness in Small Complexity Classes
We constructively prove the existence of almost complete problems under logspace manyone reduction for some small complexity classes by exhibiting a parametrizable construction which yields, when appropriately setting the parameters, an almost complete problem for PSPACE, the class of space efficiently decidable problems, and for SUBEXP, the class of problems decidable in subexponential time. O...
متن کاملLogics for complexity classes
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered structures, and another form to define them on unordered non-Aristotelian structures. Using the canonical forms, logics are developed for complete problems in various ...
متن کاملLower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them, typically the planar versions of many NP-complete problems are recognized by nondeterministic RAMs in linear time and sublinear space. The main results of this paper...
متن کاملEncyclopaedia of Complexity Results for Finite - Horizon MarkovDecision Process Problems
The computational complexity of nite horizon policy evaluation and policy existence problems are studied for several policy types and representations of Markov decision processes. In almost all cases, the problems are shown to be complete for their complexity classes; classes range from nondeterministic logarithmic space and probabilistic logarithmic space (highly parallelizable classes) to exp...
متن کامل